Numerically and parallel scalable TFETI algorithms for quasistatic contact
نویسندگان
چکیده
This paper deals with the solution of the discretized quasistatic 3D Signorini problems with local Coulomb friction. After a time discretization we obtain a system of static contact problems with Coulomb friction. Each of these problems is decomposed by the TFETI domain decomposition method used in auxiliary contact problemswith Tresca friction. The algebraic formulation of these problems in 3D leads to the quadratic programing with equality constraints together with box and separable quadratic constraints. For the solution we used the scalable algorithm SMALSE developed at our department. The efficiency of the method is demonstrated by results of numerical experiments with parallel solution of 3D contact problems of elasticity.
منابع مشابه
UN CO RR EC TE D PR O O F 1 A Comparison of TFETI and TBETI for Numerical 2 Solution of Engineering Problems of Contact 3 Mechanics 4
Since the introduction of Finite Element Tearing and Interconnecting (FETI) by 10 Farhat and Roux in 1991, the method has been recognized to be an efficient parallel technique 11 for the solution of partial differential equations. In 2003 Langer and Steinbach formulated its 12 boundary element counterpart (BETI), which reduces the problem dimension to subdomain 13 boundaries. Recently, we have ...
متن کاملGeneric Convex Collision Detection using Support Mapping
A collision detection algorithm that is computationally efficient, numerically stable, and straightforward to implement is a valuable tool in any virtual environment. This includes the ability to determine accurate proximity information, such as, penetration depth, contact position, and separating normal. We explore the practical and scalable issues of support mapping for use in detecting conta...
متن کاملA TFETI domain decomposition solver for elastoplastic problems
We propose an algorithm for the efficient parallel implementation of elastoplastic problems with hardening based on the so-called TFETI (Total Finite Element Tearing and Interconnecting) domain decomposition method. We consider an associated elastoplastic model with the von Mises plastic criterion and the linear isotropic hardening law. Such a model is discretized by the implicit Euler method i...
متن کاملA TFETI Domain Decompositon Solver for Von Mises Elastoplasticity Model with Combination of Linear Isotropic-Kinematic Hardening
In this paper we present the efficient parallel implementation of elastoplastic problems based on the TFETI (Total Finite Element Tearing and Interconnecting) domain decomposition method. This approach allow us to use parallel solution and compute this nonlinear problem on the supercomputers and decrease the solution time and compute problems with millions of DOFs. In our approach we consider a...
متن کاملIntelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کامل